Deterministic Edge Connectivity in Near-Linear Time
نویسندگان
چکیده
منابع مشابه
Deterministic Edge Connectivity in Near-Linear Time
We present a deterministic algorithm that computes the edge-connectivity of a graph in near-linear time. This is for a simple undirected unweighted graph G with n vertices and m edges. This is the first o(mn) time deterministic algorithm for the problem. Our algorithm is easily extended to find a concrete minimum edge-cut. In fact, we can construct the classic cactus representation of all minim...
متن کاملA near deterministic linear optical CNOT gate
quantum information, deterministic linear optical gates, conditional measurements, hybrid systems We show how to construct a near deterministic CNOT using several single photons sources, linear optics, photon number resolving quantum non-demolition detectors and feed-forward. This gate does not require the use of massively entangled states common to other implementations and is very efficient o...
متن کاملNear-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for such problems enable the design of auctions and related pricing mechanisms [3]. In light of the fact that the problems we address are APX-hard in general [5], we design near-linear and near-cubic time approximation sc...
متن کاملHalving Balls in Deterministic Linear Time
Let D be a set of n pairwise disjoint unit balls in R and P the set of their center points. A hyperplane H is an m-separator for D if each closed halfspace bounded by H contains at leastm points from P. This generalizes the notion of halving hyperplanes, which correspond to n/2-separators. The analogous notion for point sets has been well studied. Separators have various applications, for insta...
متن کاملCertifying 3-Connectivity in Linear Time
One of the most noted construction methods of 3-vertex-connected graphs is due to Tutte and based on the following fact: Every 3-vertexconnected graph G on more than 4 vertices contains a contractible edge, i. e., an edge whose contraction generates a 3-connected graph. This implies the existence of a sequence of edge contractions from G to K4 such that every intermediate graph is 3-vertex-conn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2019
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3274663